cyclotomic integer

См. также в других словарях:

• Cyclotomic polynomial — In algebra, the nth cyclotomic polynomial, for any positive integer n, is the monic polynomial: where the product is over all nth primitive roots of unity ω in a field, i.e. all the complex numbers ω of order n. Contents 1 Properties …   Wikipedia

• Gaussian integer — In number theory, a Gaussian integer is a complex number whose real and imaginary part are both integers. The Gaussian integers, with ordinary addition and multiplication of complex numbers, form an integral domain, usually written as Z[i]. The… …   Wikipedia

• Algebraic integer — This article deals with the ring of complex numbers integral over Z. For the general notion of algebraic integer, see Integrality .In number theory, an algebraic integer is a complex number which is a root of some monic polynomial (leading… …   Wikipedia

• P-group — In mathematics, given a prime number p , a p group is a periodic group in which each element has a power of p as its order. That is, for each element g of the group, there exists a nonnegative integer n such that g to the power pn is equal to the …   Wikipedia

• Root of unity — The 5th roots of unity in the complex plane In mathematics, a root of unity, or de Moivre number, is any complex number that equals 1 when raised to some integer power n. Roots of unity are used in many branches of mathematics, and are especially …   Wikipedia

• Proofs of quadratic reciprocity — In the mathematical field of number theory, the law of quadratic reciprocity, like the Pythagorean theorem, has lent itself to an unusual number of proofs. Several hundred proofs of the law of quadratic reciprocity have been found.Proofs that are …   Wikipedia

• Quadratic field — In algebraic number theory, a quadratic field is an algebraic number field K of degree two over Q. It is easy to show that the map d ↦ Q(√d) is a bijection from the set of all square free integers d ≠ 0, 1 to the set of… …   Wikipedia

• Algebraic number field — In mathematics, an algebraic number field (or simply number field) F is a finite (and hence algebraic) field extension of the field of rational numbers Q. Thus F is a field that contains Q and has finite dimension when considered as a vector… …   Wikipedia

• Williams' p + 1 algorithm — In computational number theory, Williams p + 1 algorithm is an integer factorization algorithm, one of the family of algebraic group factorisation algorithms. It was invented by Hugh C. Williams in 1982. It works well if the number N to be… …   Wikipedia

• Eisenstein's criterion — In mathematics, Eisenstein s criterion gives sufficient conditions for a polynomial to be irreducible over the rational numbers (or equivalently, over the integers; see Gauss s lemma). Suppose we have the following polynomial with integer… …   Wikipedia

• Bernoulli number — In mathematics, the Bernoulli numbers Bn are a sequence of rational numbers with deep connections to number theory. They are closely related to the values of the Riemann zeta function at negative integers. There are several conventions for… …   Wikipedia